Familiarity constraints on weak definite DPS

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak Definite Noun Phrases

Semantic accounts of the definite article have tended to fall into two general classes: ‘uniqueness’ accounts (Russell, 1905), and ‘familiarity’ accounts (Heim, 1982; see also Abbott, 2004, inter alia). It is also generally known that there are instances of definite descriptions that are resistant to such analyses, and are difficult to subsume under either treatment, or even a combination of bo...

متن کامل

Weak Lensing Constraints on Galaxy Halos

Weak gravitational lensing has become an important tool to study the properties of dark matter halos around galaxies, thanks to the advent of large panoramic cameras on 4m class telescopes. This area of research has been developing rapidly in the past few years, and in these proceedings we present some results based on the Red-Sequence Cluster Survey, thus highlighting what can be achieved with...

متن کامل

Weak gravity conjecture constraints on inflation

We consider the gravitational correction to the coupling of the scalar fields. Weak gravity conjecture says that the gravitational correction to the running of scalar coupling should be less than the contribution from scalar fields. For instance, a new scale Λ = λ 1/2 4 Mp sets a UV cutoff on the validity of the effective λ4φ 4 theory. Furthermore, this conjecture provides a stringent constrain...

متن کامل

Weak Familiarity and Anaphoric Accessibility in Dynamic Semantics

The accessibility constraints imposed on anaphora by dynamic theories of discourse are too strong because they rule out many perfectly felicitous cases. Several attempts have been made by previous authors to rectify this situation using various tactics. This paper proposes a more viable approach that involves replacing Heim’s notion of familiarity with a generalized variant due to Roberts. This...

متن کامل

Recollection can be weak and familiarity can be strong.

The remember-know procedure is widely used to investigate recollection and familiarity in recognition memory, but almost all of the results obtained with that procedure can be readily accommodated by a unidimensional model based on signal-detection theory. The unidimensional model holds that remember judgments reflect strong memories (associated with high confidence, high accuracy, and fast rea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Recherches linguistiques de Vincennes

سال: 2013

ISSN: 0986-6124,1958-9239

DOI: 10.4000/rlv.2177